11207 - The easiest way/p11207.cpp

   1 #include <iostream>
   2 #include <algorithm>
   3
   4 using namespace std;
   5
   6 #define MAX(a,b) (((a)>(b))?(a):(b))
   7 #define MIN(a,b) (((a)<(b))?(a):(b))
   8
   9 int main(){
  10   unsigned int n;
  11   cin >> n;
  12   while (n){
  13     unsigned int vaGanando = 0;
  14     double ganador = 0.0;
  15     for (int i=1; i<=n; i++){ /* i nos dice en que pieza de papel vamos */
  16       unsigned long h, w;
  17       cin >> h >> w;
  18       if (w > h) swap(w, h);
  19       double maxPieza = MAX(MIN(h/4.0,w),MIN(h/2.0,w/2.0));
  20       if (maxPieza > ganador){
  21         ganador = maxPieza;
  22         vaGanando = i;
  23       }
  24     }
  25     cout << vaGanando << endl;
  26     cin >> n;
  27   }
  28   return 0;
  29 }